On the Boundary of the Union of Planar Convex Sets
نویسندگان
چکیده
We give two alternative proofs leading to di erent generalizations of the following theorem of [1]. Given n convex sets in the plane, such that the boundaries of each pair of sets cross at most twice, then the boundary of their union consists of at most 6n 12 arcs. (An arc is a connected piece of the boundary of one of the sets.) In the generalizations we allow pairs of boundaries to cross more than twice.
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملOn Regular Vertices of the Union of Planar Convex Objects
Let C be a collection of n compact convex sets in the plane, such that the boundaries of any pair of sets in C intersect in at most s points, for some constant s. We show that the maximum number of regular vertices (intersection points of two boundaries that intersect twice) on the boundary of the union U of C is O(n), which improves earlier bounds due to Aronov et al. [4]. The bound is nearly ...
متن کاملFunctionally closed sets and functionally convex sets in real Banach spaces
Let $X$ be a real normed space, then $C(subseteq X)$ is functionally convex (briefly, $F$-convex), if $T(C)subseteq Bbb R $ is convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$ is functionally closed (briefly, $F$-closed), if $T(K)subseteq Bbb R $ is closed for all bounded linear transformations $Tin B(X,R)$. We improve the Krein-Milman theorem ...
متن کاملLatin-majorization and its linear preservers
In this paper we study the concept of Latin-majorizati-\on. Geometrically this concept is different from other kinds of majorization in some aspects. Since the set of all $x$s Latin-majorized by a fixed $y$ is not convex, but, consists of union of finitely many convex sets. Next, we hint to linear preservers of Latin-majorization on $ mathbb{R}^{n}$ and ${M_{n,m}}$.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 21 شماره
صفحات -
تاریخ انتشار 1999